ar X iv : 1 10 7 . 10 76 v 1 [ cs . D S ] 6 J ul 2 01 1 Genome Halving by Block Interchange

نویسنده

  • Jean-Stéphane Varré
چکیده

We address the problem of finding the minimal number of block interchanges (exchange of two intervals) required to transform a duplicated linear genome into a tandem duplicated linear genome. We provide a formula for the distance as well as a polynomial time algorithm for the sorting problem.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

ar X iv : 1 70 7 . 05 20 6 v 1 [ m at h . C A ] 4 J ul 2 01 7 Umbral Methods and Harmonic Numbers

The theory of harmonic based function is discussed here within the framework of umbral operational methods. We derive a number of results based on elementary notions relying on the properties of Gaussian integrals.

متن کامل

Approximate Generalized Matching: $f$-Factors and $f$-Edge Covers

In this paper we present linear time approximation schemes for several generalized matching problems on nonbipartite graphs. Our results include O (m)-time algorithms for (1 − )maximum weight f -factor and (1+ )-approximate minimum weight f -edge cover. As a byproduct, we also obtain direct algorithms for the exact cardinality versions of these problems running in O(m √ f(V )) time. The technic...

متن کامل

ar X iv : 1 30 7 . 17 46 v 1 [ cs . I T ] 6 J ul 2 01 3 Generalized Quasi - Cyclic Codes Over F q + u F q

Generalized quasi-cyclic (GQC) codes with arbitrary lengths over the ring Fq + uFq, where u 2 = 0, q = p, n a positive integer and p a prime number, are investigated. By the Chinese Remainder Theorem, structural properties and the decomposition of GQC codes are given. For 1-generator GQC codes, minimal generating sets and lower bounds on the minimum distance are given. As a special class of GQC...

متن کامل

ar X iv : 0 80 6 . 01 70 v 2 [ m at h . Q A ] 1 J ul 2 00 8 WEIGHT MULTIPLICITY POLYNOMIALS OF MULTI - VARIABLE WEYL MODULES

This paper is based on the observation that dimension of weight spaces of multi-variable Weyl modules depends polynomially on the highest weight (Conjecture 1). We support this conjecture by various explicit answers for up to three variable cases and discuss the underlying combinatorics.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2011